A Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games
نویسندگان
چکیده
We address the generalized Nash equilibrium seeking problem for noncooperative agents playing non-strictly monotone aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized Nash equilibria of the game as the zeros of a monotone setvalued operator. Then, we massage the Douglas–Rachford splitting to solve the monotone inclusion problem and derive a single layer, semi-decentralized algorithm whose global convergence is guaranteed under mild assumptions. The potential of the proposed Douglas–Rachford algorithm is shown on a simplified resource allocation game, where we observe faster convergence with respect to forward-backward algorithms.
منابع مشابه
Projected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...
متن کاملMonotone operator methods for Nash equilibria in non-potential games
We observe that a significant class of Nash equilibrium problems in non-potential games can be associated with monotone inclusion problems. We propose splitting techniques to solve such problems and establish their convergence. Applications to generalized Nash equilibria, zero-sum games, and cyclic proximation problems are demonstrated.
متن کاملLocal Aggregative Games
Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of pure strategy -Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an i...
متن کاملOn the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
This paper shows, by means of a new type of operator called a splitting operator, that the Douglas-Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas-Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special...
متن کاملSubmodularity and the evolution of Walrasian behavior
Vega-Redondo (1997) showed that imitation leads to the Walrasian outcome in Cournot Oligopoly. We generalize his result to aggregative quasi-submodular games. Examples are the Cournot Oligopoly, Bertrand games with differentiated complementary products, CommonPool Resource games, Rent-Seeking games and generalized Nash-Demand games. JEL-Classifications: C72, D21, D43, L13.
متن کامل